On the geometric structure of independence systemsCONFORTI, M; LAURENT, M.Mathematical programming. 1989, Vol 45, Num 2, pp 255-277, issn 0025-5610, 23 p.Article

The Weak Chebyshev X-Greedy Algorithm in the unweighted Bergman spaceDILWORTH, S. J; KUTZAROVA, Denka; SHUMAN, Karen L et al.Journal of mathematical analysis and applications. 2006, Vol 318, Num 2, pp 692-706, issn 0022-247X, 15 p.Article

The discrepancy of the lex-least de Bruijn sequenceCOOPER, Joshua; HEITSCHB, Christine.Discrete mathematics. 2010, Vol 310, Num 6-7, pp 1152-1159, issn 0012-365X, 8 p.Article

Constrained partitioning problemsBURKARD, R. E; EN-YU YAO.Discrete applied mathematics. 1990, Vol 28, Num 1, pp 21-34, issn 0166-218X, 14 p.Article

The average behaviour of greedy algorithms for the knapsack problem: General distributionsDIUBIN, Gennady; KORBUT, Alexander.Mathematical methods of operations research (Heidelberg). 2003, Vol 57, Num 3, pp 449-479, issn 1432-2994, 31 p.Article

Dynamic and distributed early planning assessment by a hybrid simulated annealing and greedy algorithmMAROPOULOS, P. G; MCKAY, K; BRAMALL, D. G et al.Proceedings of the Institution of Mechanical Engineers. Part B. Journal of engineering manufacture. 2003, Vol 217, Num 10, pp 1429-1442, issn 0954-4054, 14 p.Article

Learning Capability of Relaxed Greedy AlgorithmsSHAOBO LIN; YUANHUA RONG; XINGPING SUN et al.IEEE transactions on neural networks and learning systems (Print). 2013, Vol 24, Num 10, pp 1598-1608, issn 2162-237X, 11 p.Article

On incremental computation of transitive closure and greedy alignmentABDEDDAÏM, S.Lecture notes in computer science. 1997, pp 167-179, issn 0302-9743, isbn 3-540-63220-4Conference Paper

Δ-Matroids with the strong exchange conditionsWENZEL, W.Applied mathematics letters. 1993, Vol 6, Num 5, pp 67-70, issn 0893-9659Article

Quasi-greedy triangulations approximating the minimum weight triangulationLEVCOPOULOS, C; KRZNARIC, D.Journal of algorithms (Print). 1998, Vol 27, Num 2, pp 303-338, issn 0196-6774Conference Paper

Matchings and Δ-matroids with coefficientsKALHOFF, F; WENZEL, W.Advances in applied mathematics (Print). 1996, Vol 17, Num 1, pp 63-87, issn 0196-8858Article

Further results on T-coloring and frequency assignment problemsARUNDHATI RAYCHAUDHURI.SIAM journal on discrete mathematics (Print). 1994, Vol 7, Num 4, pp 605-613, issn 0895-4801Article

NEIGHBOR SYSTEMS AND THE GREEDY ALGORITHMHARTVIGSEN, David.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 4, pp 1638-1661, issn 0895-4801, 24 p.Article

Computerized generation of operational strategies for the management of temporary storage of drainage water from several polders in a network of small lakes and canalsBREUR, K. J; VAN NOOYEN, R. R. P; VAN LEEUWEN, P. E. R. M et al.Applied mathematical modelling. 2009, Vol 33, Num 8, pp 3330-3342, issn 0307-904X, 13 p.Article

Automated reassembly of file fragmented images using greedy algorithmsMEMON, Nasir; PAL, Anandabrata.IEEE transactions on image processing. 2006, Vol 15, Num 2, pp 385-393, issn 1057-7149, 9 p.Article

Guarantees for the success frequency of an algorithm for finding dodgson-election winnersHOMAN, Christopher M; HEMASPAANDRA, Lane A.Lecture notes in computer science. 2006, pp 528-539, issn 0302-9743, isbn 3-540-37791-3, 1Vol, 12 p.Conference Paper

A tight analysis of the greedy algorithm for set coverSLAVIK, P.Journal of algorithms (Print). 1997, Vol 25, Num 2, pp 237-254, issn 0196-6774Article

Fuzzy matroid sums and a greedy algorithmGOETSCHEL, R. JR; VOXMAN, W.Fuzzy sets and systems. 1992, Vol 52, Num 2, pp 189-200, issn 0165-0114Article

New results on the k-Truck ProblemWEIMIN MA; YINFENG XU; YOU, Jane et al.Lecture notes in computer science. 2002, pp 504-513, issn 0302-9743, isbn 3-540-43996-X, 10 p.Conference Paper

Improved performance of the greedy algorithm for partial coverSLAVIK, P.Information processing letters. 1997, Vol 64, Num 5, pp 251-254, issn 0020-0190Article

Adaptive time-frequency decompositionsDAVIS, G; MAILAT, S; ZHIFENG ZHANG et al.Optical engineering (Bellingham. Print). 1994, Vol 33, Num 7, pp 2183-2191, issn 0091-3286Article

Greedy algorithm compatibility and heavy-set structuresBRYANT, V; BROOKSBANK, P.European journal of combinatorics. 1992, Vol 13, Num 2, pp 81-86, issn 0195-6698Article

A Monge property for the d-dimensional transportation problemBEIN, W. W; BRUCKER, P; PARK, J. K et al.Discrete applied mathematics. 1995, Vol 58, Num 2, pp 97-109, issn 0166-218XConference Paper

Convergence rate of the semi-supervised greedy algorithmHONG CHEN; YICONG ZHOU; YUAN YAN TANG et al.Neural networks. 2013, Vol 44, pp 44-50, issn 0893-6080, 7 p.Article

Intrinsic mono-component decomposition of functions: An advance of Fourier theoryTAO QIAN; SPRÖSSIG, W.Mathematical methods in the applied sciences. 2010, Vol 33, Num 7, pp 880-891, issn 0170-4214, 12 p.Article